Equational zero vector databases, non-equational databases, and inherent internal control

نویسندگان

  • Roberta Ann Barra
  • Arline Savage
  • Jeff J. Tsay
چکیده

Equational zero vector accounting systems, based on duality principles and the double-entry model, were designed as ontological control systems to help prevent and detect fraud and errors inherent in non-equational, single-entry systems. Non-equational systems lend themselves to fraud and errors to a larger degree because the internal control inherent in an equational zero vector system has no substitute. We use an analytical analysis methodology to show that an equational zero vector system provides superior inherent internal control over data completeness and data reliability. In the accounting information systems area, the most popular modern non-equational system, the resource-event-agent model, is increasingly being promoted as a replacement for the equational zero vector accounting system. We contend that, although non-equational accounting system frameworks can be modelled with controls, they do not achieve the degree of control inherent in an equational zero vector accounting system without becoming an equational zero vector accounting system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FUZZY EQUATIONAL CLASSES ARE FUZZY VARIETIES

In the framework of fuzzy algebras with fuzzy equalities and acomplete lattice as a structure of membership values, we investigate fuzzyequational classes. They consist of special fuzzy algebras fullling the samefuzzy identities, dened with respect to fuzzy equalities. We introduce basicnotions and the corresponding operators of universal algebra: construction offuzzy subalgebras, homomorphisms...

متن کامل

Cylindric algebras and relational databases

An interpretation of the relational data model and various dependencies is given within the framework of cylindric algebras. It turns out that there is a natural translation of relational databases into cylindric set lattices, and that Codd’s relational operators have a simple interpretation in these structures. Consequently, various database constraints can be expressed in the equational langu...

متن کامل

A Formalization of Objects Using Equational Dynamic Logic

Order-sorted equational logic is extended with dynamic logic to a specification language for dynamic objects. Special attention is paid to different concepts of encapsulation that play a role in object-orientation. It is argued that the resulting language, CMSL, meets those requirements of the object-oriented database system manifesto [6] that are applicable to object-oriented conceptual models...

متن کامل

Complexity of Query Answering in LogicDatabases with Complex

This paper characterizes the computational complexity of nonrecursive queries in logic databases with complex values. Queries are represented by Horn clause logic programs. Complex values are represented by terms in equational theories ( nite sets and multisets are examples of such complex values). We show that the problem of whether a query has a nonempty answer is NEXP-hard for nonrecursive r...

متن کامل

Term Equational Systems and Logics

We introduce an abstract general notion of system of equations between terms, called Term Equational System, and develop a sound logical deduction system, called Term Equational Logic, for equational reasoning. Further, we give an analysis of algebraic free constructions that together with an internal completeness result may be used to synthesise complete equational logics. Indeed, as an applic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJBIS

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2010